Banach Spaces as Data Types
نویسندگان
چکیده
منابع مشابه
Banach Spaces as Data Types
We introduce the operators modified limit and accumulation on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable metric space to a computable Banach space is internally computable. We motivate the need for internal concepts of computability by observing that the complexity of th...
متن کاملTypes on stable Banach spaces
We prove a geometric characterization of Banach space stability. We show that a Banach space X is stable if and only if the following condition holds. Whenever X̂ is an ultrapower of X and B is a ball in X̂, the intersection B ∩X can be uniformly approximated by finite unions and intersections of balls in X; furthermore, the radius of these balls can be taken arbitrarily close to the radius of B,...
متن کاملMinimal Types in Stable Banach Spaces
We prove existence of wide types in a continuous theory expanding a Banach space, and density of minimal wide types among stable types in such a theory. We show that every minimal wide stable type is “generically” isometric to an l2 space. We conclude with a proof of the following formulation of Henson’s Conjecture: every model of an uncountably categorical theory expanding a Banach space is pr...
متن کاملData Assimilation in Banach spaces
The study of how to fuse measurement data with parametric models for PDEs has led to a new spectrum of problems in optimal recovery. A classical setting of optimal recovery is that one has a bounded set K in a Banach space X and a finite collection of linear functionals lj , j = 1, . . . ,m, from X ∗. Given a function which is known to be in K and to have known measurements lj(f) = wj , j = 1, ...
متن کاملDouble-dual n-types over Banach spaces not containing ℓ1
Let E be a Banach space. The concept of n-type over E is introduced here, generalizing the concept of type over E introduced by Krivine and Maurey. Let E′′ be the second dual of E and fix g′′ 1 , . . . ,g′′ n ∈ E′′. The function τ : E×Rn → R, defined by letting τ(x,a1, . . . ,an) = ‖x+∑ni=1aig′′ i ‖ for all x ∈ E and all a1, . . . ,an ∈R, defines an n-type over E. Types that can be represented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(2:11)2011